Polynomial Degree Lower Bounds
نویسندگان
چکیده
We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MODpkP, where p is a prime. Our proof makes use of the degree of a representing polynomial over Zpk . We show a linear lower bound on the degree of this polynomial. We also show an upper bound of O(n logp ) on the degree over the ring Zm, whenever m is a squarefree composite with largest prime factor p.
منابع مشابه
Universal upper and lower bounds on energy of spherical designs
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds are optimal for absolutely monotone potentials in the sense that for the linear programming technique they cannot be improved by using polynomials of the sa...
متن کاملLower Bounds by Birkhoff Interpolation
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor. Previous lower bounds for this problem were only of order Ω( √...
متن کاملOn the Alekhnovich–Razborov degree lower bound
Polynomial calculus is a Hilbert-style proof system in which lines are polynomials modulo x = x (for each variable x) and the rules allow deriving c1P1 + c2P2 from P1, P2 and xP from P for a variable x. A polynomial calculus refutation of a set of axioms is a derivation of 1 from these axioms. Research in proof complexity tends to concentrate on the length of proofs. We will rather be intereste...
متن کاملar X iv : 1 50 4 . 01 65 6 v 1 [ cs . C C ] 7 A pr 2 01 5 Tight Size - Degree Bounds for Sums - of - Squares Proofs ∗
We exhibit families of 4-CNF formulas over n variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) d but require SOS proofs of size n for values of d = d(n) from constant all the way up to n for some universal constant δ. This shows that the n running time obtained by using the Lasserre semidefinite programming relaxations to find degree-d SOS proofs is op...
متن کاملLower Bounds Using Dual Polynomials ∗
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x 1 ,. .. , x n) that approximates or sign-represents a given Boolean function f (x 1 ,. .. , x n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., poly...
متن کاملOn Improved Degree Lower Bounds for Polynomial Approximation
A polynomial P ∈ F[X1, . . . , Xn] is said to ε-approximate a boolean function F : {0, 1} → {0, 1} under distribution D over {0, 1} if Prx∼D[P (x) 6= F (x)] ≤ ε. Smolensky (1987) showed that for any constant primes p 6= q, any polynomial P ∈ Fp[x1, . . . , xn] that ( 1 2q − Ω(1))-approximates the boolean function MODq : {0, 1} → {0, 1} – which accepts its input iff the number of ones is non-zer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007